Spectrum of a substitution minimal set
نویسندگان
چکیده
منابع مشابه
Obtaining a minimal set of rewrite rules
In this paper we describe a new approach to rewrite rule extraction and analysis, using Minimal Representation Graphs. This approach provides a mechanism for obtaining the smallest possible rule set – within a context-dependent rewrite rule formalism – that describes a set of discrete training data completely, as an indirect approach to obtaining optimal accuracy on an unseen test set. We demon...
متن کاملMinimal Dominating Set Enumeration
Let G be a graph on n vertices and m edges. An edge is written xy (equivalently yx). A dominating set in G is a set of vertices D such that every vertex of G is either in D or is adjacent to some vertex of D. It is said to be minimal if it does not contain any other dominating set as a proper subset. For every vertex x let N [x] be {x} ∪ {y | xy ∈ E}, and for every S ⊆ V let N [S] := ⋃ x∈S N [x...
متن کاملA Statistics-directed Minimal Hitting Set Algorithm ⋆
Generating minimal hitting sets of a collection of sets is known to be NPhard, necessitating heuristic approaches to handle large problems. In this paper a low-cost, approximate minimal hitting set (MHS) algorithm, coined Staccato, is presented. Staccato uses a heuristic function, borrowed from a lightweight, statistics-based software fault localization approach, to guide the MHS search. Given ...
متن کاملA Minimal Model for Set Theory
In the proof of the consistency of the Continuum Hypothesis and the Axiom of Choice with the other axioms of set theory, Gödel [ l ] introduced the notion of a constructible set and showed that the constructible sets form a model for set theory. These sets are intuitively those which can be reached by means of a transfinite sequence of several simple operations. He then showed that the Axiom of...
متن کاملA Minimal Critical Set of a Class of Youden Squares
We consider the Youden square formed by deleting one row of a v×v back-circulant Latin square and establish a critical set that contains a number of elements which is equal to v/4 (v even) or (v − 1)/4 (v odd). We show that this critical set is minimal, for v even.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1970
ISSN: 0025-5645
DOI: 10.2969/jmsj/02240567